Simple and efficient network decomposition and synchronization

نویسندگان

  • Shlomo Moran
  • Sagi Snir
چکیده

We present a simple and e cient method for constructing sparse decompositions of networks. This method is used to construct the sparse decompositions needed for variants of the synchronizers in [2, 15] in O(|V |) time and O(|E| + |V | log |V |) communication complexities, while maintaining constant messages size and constant memory per edge. Using these decompositions, we present simple and e cient variants of the synchronizers in the above papers. For example, our constructions enable to perform Breadth First Search in an asynchronous network, in which no preprocessing had been done, in communication and time complexities of O(K |V |D+ |E|+ |V | log |V |) and O(D logK |V |+ |V |); respectively, where K¿2 is a parameter, and D is the diameter of the network. We also present an e cient cover-coarsening algorithm, which uses a novel technique for e cient merging of clusters, and improves previous coarsening algorithms in several aspects. c © 2000 Elsevier Science B.V. All rights reserved

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-stage Stochastic Programing Based on the Accelerated Benders Decomposition for Designing Power Network Design under Uncertainty

In this paper, a comprehensive mathematical model for designing an electric power supply chain network via considering preventive maintenance under risk of network failures is proposed. The risk of capacity disruption of the distribution network is handled via using a two-stage stochastic programming as a framework for modeling the optimization problem. An applied method of planning for the net...

متن کامل

Chaotic dynamics and synchronization of fractional order PMSM ‎system

‎In this paper, we investigate the chaotic behaviors of the fractional-order permanent magnet synchronous motor (PMSM) system. The necessary condition for the existence of chaos in the fractional-order PMSM system is deduced and an active controller is developed based on the stability theory for fractional systems. The presented control scheme  is simple and flexible, and it is suitable both fo...

متن کامل

Synchronization for Complex Dynamic Networks with State and Coupling Time-Delays

This paper is concerned with the problem of synchronization for complex dynamic networks with state and coupling time-delays. Therefore, larger class and more complicated complex dynamic networks can be considered for the synchronization problem. Based on the Lyapunov-Krasovskii functional, a delay-independent criterion is obtained and formulated in the form of linear matrix inequalities (LMIs)...

متن کامل

Computer Network Time Synchronization using a Low Cost GPS Engine

Accurate and reliable time is necessary for financial and legal transactions, transportation, distribution systems, and many other applications. Time synchronization protocols such as NTP (the Network Time Protocol) have kept clocks of such applications synchronized to each other for many years. Nowadays there are many commercial GPS based NTP time server products at the market but they almost ...

متن کامل

Area Energy and Throughput Targeting in Debottlenecking of Heat Exchanger Networks with Decomposition Approach

For energy saving retrofit projects, its economics are usually evaluated in terms of capital investment and payback time. The capital investment is in direct relation to the total heat recovery area of the network and the payback time factor is base on both the area and the energy savings. The debottlenecking is an increased throughput, which can be profitable in economic sense. The combination...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 243  شماره 

صفحات  -

تاریخ انتشار 2000